Dimension and rank for mapping class groups

We study the large scale geometry of the mapping class group, MCG. Our main result is that for any asymptotic cone of MCG, the maximal dimension of locally compact subsets coincides with the maximal rank of free abelian subgroups of MCG. An application is an affirmative solution to Brock-Farb's Rank Conjecture which asserts that MCG has quasi-flats of dimension N if and only if it has a rank N free abelian subgroup. We also compute the maximum dimension of quasi-flats in Teichmuller space with the Weil-Petersson metric.Comment: Incorporates referee's suggestions. To appear in Annals of Mathematic

Geometry of the Complex of Curves I: Hyperbolicity

The Complex of Curves on a Surface is a simplicial complex whose vertices are homotopy classes of simple closed curves, and whose simplices are sets of homotopy classes which can be realized disjointly. It is not hard to see that the complex is finite-dimensional, but locally infinite. It was introduced by Harvey as an analogy, in the context of Teichmuller space, for Tits buildings for symmetric spaces, and has been studied by Harer and Ivanov as a tool for understanding mapping class groups of surfaces. In this paper we prove that, endowed with a natural metric, the complex is hyperbolic in the sense of Gromov. In a certain sense this hyperbolicity is an explanation of why the Teichmuller space has some negative-curvature properties in spite of not being itself hyperbolic: Hyperbolicity in the Teichmuller space fails most obviously in the regions corresponding to surfaces where some curve is extremely short. The complex of curves exactly encodes the intersection patterns of this family of regions (it is the "nerve" of the family), and we show that its hyperbolicity means that the Teichmuller space is "relatively hyperbolic" with respect to this family. A similar relative hyperbolicity result is proved for the mapping class group of a surface. We also show that the action of pseudo-Anosov mapping classes on the complex is hyperbolic, with a uniform bound on translation distance.Comment: Revised version of IMS preprint. 36 pages, 6 Figure

Zero-Reachability in Probabilistic Multi-Counter Automata

We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we are interested in the probability of all runs that visit zero in some counter, we show that the qualitative zero-reachability is decidable in time which is polynomial in the size of a given pMC and doubly exponential in the number of counters. Further, we show that the probability of all zero-reaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 in time which is polynomial in log(epsilon), exponential in the size of a given pMC, and doubly exponential in the number of counters. In the second case, we are interested in the probability of all runs that visit zero in some counter different from the last counter. Here we show that the qualitative zero-reachability is decidable and SquareRootSum-hard, and the probability of all zero-reaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 (these result applies to pMC satisfying a suitable technical condition that can be verified in polynomial time). The proof techniques invented in the second case allow to construct counterexamples for some classical results about ergodicity in stochastic Petri nets.Comment: 20 page

Theory of spike timing based neural classifiers

We study the computational capacity of a model neuron, the Tempotron, which classifies sequences of spikes by linear-threshold operations. We use statistical mechanics and extreme value theory to derive the capacity of the system in random classification tasks. In contrast to its static analog, the Perceptron, the Tempotron's solutions space consists of a large number of small clusters of weight vectors. The capacity of the system per synapse is finite in the large size limit and weakly diverges with the stimulus duration relative to the membrane and synaptic time constants.Comment: 4 page, 4 figures, Accepted to Physical Review Letters on 19th Oct. 201

Centroids and the Rapid Decay property in mapping class groups

We study a notion of a Lipschitz, permutation-invariant "centroid" for triples of points in mapping class groups MCG(S), which satisfies a certain polynomial growth bound. A consequence (via work of Drutu-Sapir or Chatterji-Ruane) is the Rapid Decay Property for MCG(S).Comment: v3. Numerous typos fixed and some arguments elucidate

Time lower bounds for nonadaptive turnstile streaming algorithms

We say a turnstile streaming algorithm is "non-adaptive" if, during updates, the memory cells written and read depend only on the index being updated and random coins tossed at the beginning of the stream (and not on the memory contents of the algorithm). Memory cells read during queries may be decided upon adaptively. All known turnstile streaming algorithms in the literature are non-adaptive. We prove the first non-trivial update time lower bounds for both randomized and deterministic turnstile streaming algorithms, which hold when the algorithms are non-adaptive. While there has been abundant success in proving space lower bounds, there have been no non-trivial update time lower bounds in the turnstile model. Our lower bounds hold against classically studied problems such as heavy hitters, point query, entropy estimation, and moment estimation. In some cases of deterministic algorithms, our lower bounds nearly match known upper bounds

Is This a Joke? Detecting Humor in Spanish Tweets

While humor has been historically studied from a psychological, cognitive and linguistic standpoint, its study from a computational perspective is an area yet to be explored in Computational Linguistics. There exist some previous works, but a characterization of humor that allows its automatic recognition and generation is far from being specified. In this work we build a crowdsourced corpus of labeled tweets, annotated according to its humor value, letting the annotators subjectively decide which are humorous. A humor classifier for Spanish tweets is assembled based on supervised learning, reaching a precision of 84% and a recall of 69%.Comment: Preprint version, without referra

Magic number 7 ±\pm 2 in networks of threshold dynamics

Information processing by random feed-forward networks consisting of units with sigmoidal input-output response is studied by focusing on the dependence of its outputs on the number of parallel paths M. It is found that the system leads to a combination of on/off outputs when $M \lesssim 7$, while for $M \gtrsim 7$, chaotic dynamics arises, resulting in a continuous distribution of outputs. This universality of the critical number $M \sim 7$ is explained by combinatorial explosion, i.e., dominance of factorial over exponential increase. Relevance of the result to the psychological magic number $7 \pm 2$ is briefly discussed.Comment: 6 pages, 5 figure